Discrete Lot–Sizing and Convex Integer Programming
نویسندگان
چکیده
We study the polyhedral structure of variants of the discrete lot–sizing problem viewed as special cases of convex integer programs. Our approach in studying convex integer programs is to develop results for simple mixed integer sets that can be used to model integer convex objective functions. These results allow us to define integral linear programming formulations for the discrete lot–sizing problem in which backlogging and/or safety stocks are present, and to give extended formulations for other cases. Our results help significantly to solve test cases arising from an industrial application motivating this research. CORE, Université Catholique de Louvain, Belgium CORE and INMA, Université Catholique de Louvain, Belgium This paper presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister’s Office, Science Policy Programming. The scientific responsibility is assumed by the authors. This research was also supported by the European Commission GROWTH Programme, Research Project LISCOS, Large Scale Integrated Supply Chain Optimization Software Based on Branch–and–Cut and Constraint Programming Methods, Contract No. GRDI–1999–10056.
منابع مشابه
Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges
Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtain...
متن کاملLot-sizing with stock upper bounds and fixed charges
Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtain...
متن کاملOPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملMulti-Item capacitated lot-Sizing problem with setup times and shortage costs : Polyhedral results
We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but can be totally or partially lost. The problem can be modelled as a mixed integer program and it is NP-hard. In this paper, we propose some classes of valid inequalities based on a generalization of Miller et al. [17] ...
متن کاملOn the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
We consider the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs and times and propose to solve it as a mixed-integer program using a commercial solver. Our approach is based on the extension of an existing tight formulation for the case without changeover times. Computational results con rm the bene ts of the proposed solution procedure.
متن کامل